Constraints in Non-Boolean Contexts
نویسندگان
چکیده
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of constraints on local variables in non-Boolean expressions. Specifications using these facilities are often more succinct. However, these specifications are typically executed on solvers that only support questions of the form of existentially quantified conjunctions of constraints. We show how we can translate expressions with constraints appearing in non-Boolean contexts into conjunctions of ordinary constraints. The translation is clearly structured into constrained type elimination, local variable lifting and partial function elimination. We explain our approach in the context of the modelling language Zinc. An implementation of it is an integral part of our Zinc compiler. 1998 ACM Subject Classification F.4.1 Mathematical Logic: Logic and constraint programming; F.3.3 Semantics of Programming Languages; I.2.2 Automatic Programming: Program transformation
منابع مشابه
MiniZinc with Functions
Functional relations are ubiquitous in combinatorial problems – the Global Constraint Catalog lists 120 functional constraints. This paper argues that the ability to express functional constraints with functional syntax leads to more elegant and readable models, and that it enables a better translation of the models to different underlying solving technologies such as CP, MIP, or SAT. Yet, most...
متن کاملMaintaining Generalized Arc Consistency on Ad-Hoc n-Ary Boolean Constraints
Binary decision diagrams (BDDs) can compactly represent ad-hoc nary Boolean constraints. However, there is no generalized arc consistency (GAC) algorithm which exploit BDDs. For example, the global case constraint by SICStus Prolog for ad-hoc constraints is designed for nonBoolean domains. In this paper, we introduce a new GAC algorithm, bddc, for BDD constraints. Our empirical results demonstr...
متن کاملConstraint-based concept mining and its application to microarray data analysis
We are designing new data mining techniques on boolean contexts to iden-tify a priori interesting bi-sets, i.e., sets of objects (or transactions) and asso-ciated sets of attributes (or items). It improves the state of the art in manyapplication domains where transactional/boolean data are to be mined (e.g.,basket analysis, WWW usage mining, gene expression data analysis). T...
متن کاملUniversally Quantified Interval Constraints
Non-linear real constraint systems with universally and/or existentially quantified variables often need be solved in such contexts as control design or sensor planning. To date, these systems are mostly handled by computing a quantifier-free equivalent form by means of Cylindrical Algebraic Decomposition (CAD). However, CAD restricts its input to be conjunctions and disjunctions of polynomial ...
متن کاملEfficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure
In order to facilitate automated reasoning about large Boolean combinations of nonlinear arithmetic constraints involving transcendental functions, we provide a tight integration of recent SAT solving techniques with interval-based arithmetic constraint solving. Our approach deviates substantially from lazy theorem proving approaches in that it directly controls arithmetic constraint propagatio...
متن کامل